Decomposing Infinite 2-Connected Graphs into 3-Connected Components
نویسندگان
چکیده
منابع مشابه
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960’s, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated by a problem concerning accumulation points of infinite planar graphs, we generalize Tutte’s decomposition to include all infinite 2-connected graphs.
متن کاملDecomposing infinite matroids into their 3-connected minors
s Elgersburg 2011 Rainbow Cycles in Cube Graphs Jens-P. Bode (Technische Universität Braunschweig) Joint work with A. Kemnitz and S. Struckmann A graph G is called rainbow with respect to an edge coloring if no two edges of G have the same color. Given a host graph H and a guest graph G ⊆ H, an edge coloring of H is called G-anti-Ramsey if no subgraph of H isomorphic to G is rainbow. The anti-R...
متن کاملDecomposing Boolean formulas into connected components
The aim of this contribution is to find a way how to improve efficiency of current state-of-the-art satisfiability solvers. The idea is to split a given instance of the problem into parts (connected components) which can be solved separately. For this purpose we define component trees and a related problem of finding optimal component trees. We describe how this approach can be combined with st...
متن کاملDecomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This observation allows components to be solved individually. We present a technique to handle components within a GRASP like SAT solver without requiring much change to the solver. Results obtained when applying our impleme...
متن کاملA Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components
Tutte has described in the book “Connectivity in graphs” a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics) Tutte’s decomposition into a general grammar expressing any family G of graphs (with some stability conditions) in terms of the subfamily G3 of graphs in G that are 3-connected (until now, such a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2004
ISSN: 1077-8926
DOI: 10.37236/1778